Obtaining and maintaining polynomial-sized concept lattices
نویسندگان
چکیده
We use our definition of an underlying co-bipartite graph which encodes a given binary relation to propose a new approach to defining a sub-relation or incrementally maintaining a relation which will define only a polynomial number of concepts.
منابع مشابه
A Linear Delay Algorithm for Building Concept Lattices
Concept lattices (also called Galois lattices) have been applied in numerous areas, and several algorithms have been proposed to construct them. Generally, the input for lattice construction algorithms is a binary matrix with size |G||M | representing binary relation I ⊆ G×M . In this paper, we consider polynomial delay algorithms for building concept lattices. Although the concept lattice may ...
متن کاملComparator Circuits over Finite Bounded Posets
Comparator circuit model was originally introduced in [5] (and further studied in [2]) to capture problems which are not known to be P-complete but still not known to admit efficient parallel algorithms. The class CC is the complexity class of problems many-one logspace reducible to the Comparator Circuit Value Problem and we know that NLOG ⊆ CC ⊆ P. Cook et al [2] showed that CC is also the cl...
متن کاملOn generalized topological molecular lattices
In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...
متن کاملConsecutive - ones : handling lattice planarity efficiently 3
A concept lattice may have a size exponential in the number of objects it models. Polynomial-size lattices and/or compact representations are thus desirable. This is the case for planar concept lattices, which has both polynomial size and representation without edge crossing, but a generic process for drawing them efficiently is yet to be found. Recently, it has been shown that when the relatio...
متن کاملConsecutive-ones: Handling Lattice Planarity Efficiently
A concept lattice may have a size exponential in the number of objects it models. Polynomial-size lattices and/or compact representations are thus desirable. This is the case for planar concept lattices, which has both polynomial size and representation without edge crossing, but a generic process for drawing them efficiently is yet to be found. Recently, it has been shown that when the relatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002